Blurred Noisy Convolution ( Brightness normalized ) Integrate Measure
نویسندگان
چکیده
The optimal focus measure for a noisy camera in passive search based autofocusing (AF) and depth-from-focus (DFF) applications depends not only the camera characteristics but also the image of the object being focused or ranged. In the early stage of this research, a new metric named Autofocusing Uncertainty Measure (AUM) was deened which is useful in selecting the most accurate focus measure from a given set of focus measures. AUM is a metric for comparing the noise sensitivity of diierent focus measures. In the later stage of this research, an improved metric named Autofocusing Root-Mean-Square Error (ARMS error) was deened. Explicit expressions have been derived for both AUM and ARMS error, and the two metrics are shown to be related by a monotonic expression. AUM and ARMS error metrics are based on a theoretical noise sensitivity analysis of focus measures. In comparison, all known prior work on comparing the noise sensitivity of focus measures have been a combination of subjective judgement and experimental observations. For a given camera, the optimally accurate focus measure may change from one object to the other depending on their focused images. Therefore selecting the optimal focus measure from a given set involves computing all focus measures in the set. However, if computation needs to be minimized, then it is argued that energy of the Laplacian of the image is a good focus measure and is recommended for use in practical applications. Important properties of the Laplacian focus measure are investigated.
منابع مشابه
Convolution, Smoothing, and Image Derivatives
Computer vision operates on images that usually come in the form of arrays of pixel values. These values are invariably affected by noise, so it is useful to clean the images somewhat by an operation, called smoothing, that replaces each pixel by a linear combination of some of its neighbors. Smoothing reduces the effects of noise, but blurs the image. In the case of noise suppression, blurring...
متن کاملRecovering Convex Boundaries from Blurred and Noisy Observations1 by Alexander Goldenshluger
We consider the problem of estimating convex boundaries from blurred and noisy observations. In our model, the convolution of an intensity function f is observed with additive Gaussian white noise. The function f is assumed to have convex support G whose boundary is to be recovered. Rather than directly estimating the intensity function, we develop a procedure which is based on estimating the s...
متن کاملGlobal Image Alignment With Any Local Match Measure
The paper presents a new algorithm for parametric image alignment which when given any local match measure applies global estimation directly to the lo cal match measure data without rst going through an intermediate step of local ow estimation This algo rithm can be applied to any local match measure such as correlation normalized correlation squared or ab solute brightness di erences statisti...
متن کاملThreshold based Approach for Image Blind Deconvolution
Having attractiveness in digital cameras, the digital image processing is getting more imperative nowadays. One of the most common problems facing with digital photography is noise and blurring that needs restoration. In this paper, we present a new method for image blind deconvolution [2]. The Proposed Method employs threshold based image restoration technique in blind image deconvolution. The...
متن کاملSpeech Emotion Recognition Based on Power Normalized Cepstral Coefficients in Noisy Conditions
Automatic recognition of speech emotional states in noisy conditions has become an important research topic in the emotional speech recognition area, in recent years. This paper considers the recognition of emotional states via speech in real environments. For this task, we employ the power normalized cepstral coefficients (PNCC) in a speech emotion recognition system. We investigate its perfor...
متن کامل